In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark sui...

The two-machine permutation flowshop scheduling problem to minimize makespan or total completion time criterion is addressed where setup times are considered to be separate from processing times. Setup times are relaxed to be random variables as opposed to the common assumption in the literature that setup times are exactly known (deterministic) in advance. The probability distributions of setu...

The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the computing power of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In this paper, a novel criterion of a sche...

This paper addresses the analysis of any nondelay, nonpreemptive online schedule for independent jobs on m identical machines. The release dates and the processing times of the jobs are unknown and all jobs have the same priority. For this scenario, it is well known that a tight competitive factor of 2− 1 m can be achieved for the makespan. However in this online scenario, the makespan criterio...

We provide polynomial-time approximately optimal Bayesian mechanisms for makespan min-imization on unrelated machines as well as for max-min fair allocations of indivisible goods, withapproximation factors of 2 and min{m− k + 1, Õ(√k)} respectively, matching the approxima-tion ratios of best known polynomial-time algorithms (for max-min fairness, the latter claimis true ...

A two-stage algorithm for scheduling preemptive jobs on parallel machines with minimum makespan criterion and requirements for limited renewable resources and existence of sequence dependent setup times is investigated. In the first stage of the algorithm a set of best elementary feasible plans is obtained through column generation. For the second stage we compare genetic algorithms for sequenc...

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

We investigate the approximability of no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for problem on any fixed number of machines.

The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the speed of each processor of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In contrast, recently the authors ...